Some generalized projection methods for solving operator equations
نویسندگان
چکیده
منابع مشابه
USING FRAMES OF SUBSPACES IN GALERKIN AND RICHARDSON METHODS FOR SOLVING OPERATOR EQUATIONS
In this paper, two iterative methods are constructed to solve the operator equation $ Lu=f $ where $L:Hrightarrow H $ is a bounded, invertible and self-adjoint linear operator on a separable Hilbert space $ H $. By using the concept of frames of subspaces, which is a generalization of frame theory, we design some algorithms based on Galerkin and Richardson methods, and then we in...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملA Class of Iterative Methods for Solving Nonlinear Projection Equations
A class of globally convergent iterative methods for solving nonlinear projection equations is provided under a continuity condition of the mapping F. When Fis pseudomonotone, a necessary and sufficient condition on the nonemptiness of the solution set is obtained.
متن کاملConvergence of iterative methods for solving random operator equations
We discuss the concept of probabilistic quasi-nonexpansive mappings in connection with the mappings of Nishiura. We also prove a result regarding the convergence of the sequence of successive approximations for probabilistic quasi-nonexpansive mappings.
متن کاملCertain approximate methods for solving linear operator equations
A solution of linear operator equations in the Hilbert space is constructed by using the best polynomial approximation of the inverse operator. This approach gives rise to certain iteration processes. Error estimates manifest that the suggested schemes may be fairly efficient. c © 2006 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1992
ISSN: 0377-0427
DOI: 10.1016/0377-0427(92)90216-k